The Syndrome Bit Flipping Algorithm for LDPC Codes

نویسندگان

چکیده

Performance of LDPC decoders at high SNR is dominated by trapping sets that induce an error floor in the performance curve. We propose a new algorithm resolves and lowers floor. The algorithm, called Syndrome Bit Flipping (SBF), computes sum adjacent parity violations each symbol node. Bits are flipped comparing syndrome against time-varying threshold decoding key. SBF compared to other bit-flipping on Binary Symmetric Channel (BSC), demonstrated as post-processing step for Noisy Gradient Descent Bit-Flipping (NGDBF) hardware decoder. demonstrate method code defined 802.3an standard, find frame rate improved least two orders magnitude, even required iterations reduced 33%.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

Check Reliability Based Bit-Flipping Decoding Algorithms for LDPC Codes

We introduce new reliability definitions for bit and check nodes. Maximizing global reliability, which is the sum reliability of all bit nodes, is shown to be equivalent to minimizing a decoding metric which is closely related to the maximum likelihood decoding metric. We then propose novel bit-flipping (BF) decoding algorithms that take into account the check node reliability. Both hard-decisi...

متن کامل

Design of Enhanced Multi-bit Threshold Bit Flipping Algorithm for Low Complex Ldpc Decoders

Communication is transfer of information from source to sink or sender to receiver. The signal when transferred through the noisy channel gets affected by the noise and becomes an error signal when it reaches the receiver. Decoding is the process of retrieving the correct information from the received signal. The weighted bit flipping LDPC decoding algorithm gives a good performance in retrievi...

متن کامل

BIT−FLIPPING POST−PROCESSING FOR FORCED CONVERGENCE DECODING OF LDPC CODES (MonPmOR8)

The recently proposed forced convergence technique allows for reducing the decoding complexity of Low−Density Parity−Check Codes (LDPCC) at only slight deterioration in performance. The basic idea is to restrict the message passing during LDPC decoding to the nodes that still significantly contribute to the decoding result. In this paper, we propose to add a bit−flipping post−processor to the f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Communications Letters

سال: 2023

ISSN: ['1558-2558', '1089-7798', '2373-7891']

DOI: https://doi.org/10.1109/lcomm.2023.3272277